Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
نویسندگان
چکیده
منابع مشابه
Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication
Let G = (S, T, E) be a bipartite-graph, where S U T is the set of nodes (S n T = 8) and E is the set of edges, E c S X T. Let S = {ur , . . . . II,}, T = {VI, . . . . vt} (A t), and 1 E I= e. An (S, T) matching is a subset M of E such that no two edges in M have a common endpoint. A maximum matching is a matching of maximum cardinality. The set of nodes which take part in such a maximum matchin...
متن کاملMaximum weight bipartite matching in matrix multiplication time
In this paper we consider the problem of finding maximum weight matchings in bipartite graphs with nonnegative integer weights. The presented algorithm for this problemworks in Õ(Wnω)1 time, whereω is thematrixmultiplication exponent, andW is the highest edge weight in the graph. As a consequence of this result we obtain Õ(Wn) time algorithms for computing: minimum weight bipartite vertex cover...
متن کاملGPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs
We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer science, scientific computing, bioinformatics, and other areas. To the best of our knowledge, ours is the first study which focuses on GPU implementation of the maximum cardinality matching algorithms. We compare the...
متن کاملFast Matrix Multiplication Algorithms on Mimd Architectures
Sequential fast matrix multiplication algorithms of Strassen and Winograd are studied; the complexity bound given by Strassen is improved. These algorithms are parallelized on MIMD distributed memory architectures of ring and torus topologies; a generalization to a hyper-torus is also given. Complexity and efficiency are analyzed and good asymptotic behaviour is proved. These new parallel algor...
متن کاملAlgorithms for Matrix Multiplication
Strassen’s and Winograd’s algorithms for n × n matrix multiplication are investigated and compared with the normal algorithm. The normal algorithm requires n3 + O(n2) multiplications and about the same number of additions. Winograd’s algorithm almost halves the number of multiplications at the expense of more additions. Strassen’s algorithm reduces the total number of operations to O(n2.82) by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1981
ISSN: 0020-0190
DOI: 10.1016/0020-0190(81)90142-3